Finite-type-Dyck shift spaces
نویسندگان
چکیده
We study some basic properties of sofic-Dyck shifts and finite-type-Dyck shifts. We prove that the class of sofic-Dyck shifts is stable under proper conjugacies. We prove a Decomposition Theorem of a proper conjugacy between edge-Dyck shifts into a sequence of Dyck splittings and amalgamations.
منابع مشابه
Combinations of Context-Free Shifts and Shifts of Finite Type
A Dyck shift and a Motzkin shift are mathematical models for constraints on genetic sequences. In terms of the theory of symbolic dynamics, neither of the Dyck shift nor the Motzkin shift is sofic. In terms of the mathematical language theory, they are non-regular and context free languages. Therefore we can not use the Perron-Frobenius theory to calculate capacities of these constraints. O. Mi...
متن کاملTEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES SCHOOL OF MATHEMATICAL SCIENCES Tail Invariant Measures of The Dyck-Shift and Non-Sofic Systems
Among the most familiar systems in symbolic dynamics are the subshifts of finite type, or SFT’s for short. SFT’s are relatively easy to analyze, and have many pleasant properties such as intrinsic ergodicity and unique ergodicity with respect to the tail. A larger class, which has the desirable property of being closed under factors, is that of sofic systems. This class of systems retains many ...
متن کاملTail Invariant Measures of the Dyck Shift
We show that the one-sided Dyck shift has a unique tail invariant topologically σ-finite measure (up to scaling). This invariant measure of the one sided Dyck turns out to be a shift-invariant probability. Furthermore, it is one of the two ergodic probabilities obtaining maximal entropy. For the two sided Dyck shift we show that there are exactly three ergodic double-tail invariant probabilitie...
متن کاملZeta Functions and Topological Entropy of the Markov-dyck Shifts
The Markov-Dyck shifts arise from finite directed graphs. An expression for the zeta function of a Markov-Dyck shift is given. The derivation of this expression is based on a formula in Keller (G. Keller, Circular codes, loop counting, and zeta-functions, J. Combinatorial Theory 56 (1991), pp. 75– 83). For a class of examples that includes the Fibonacci-Dyck shift the zeta functions and topolog...
متن کاملSofic-Dyck Shifts
We define the class of sofic-Dyck shifts which extends the class of Markov-Dyck shifts introduced by Inoue, Krieger and Mat-sumoto. Sofic-Dyck shifts are shifts of sequences whose finite factors form unambiguous context-free languages. We show that they correspond exactly to the class of shifts of sequences whose sets of factors are visibly pushdown languages. We give an expression of the zeta ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1311.4223 شماره
صفحات -
تاریخ انتشار 2013